Decidability of logic program semantics and applications to testing
نویسندگان
چکیده
منابع مشابه
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic extended with disjunctive connectives. The extended logic can be seen as an instance of Hybrid IS5. ...
متن کاملComplementing Logic Program Semantics
We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning ...
متن کاملFrom Rewriting Logic Executable Semantics to Matching Logic Program Verification
Rewriting logic semantics (RLS) is a definitional framework in which a programming language is defined as a rewrite theory: the algebraic signature defines the program configurations, the equations define structural identities on configurations, and the rewrite rules define the irreversible computational steps. RLS language definitions are efficiently executable using conventional rewrite engin...
متن کاملTopological Semantics and Decidability
It is well-known that the basic modal logic of all topological spaces is S4. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of T0, T1 and T2 topological spaces coincide and are S4. We also examine basic hybrid logics of these classes and prove their decidability; as part of t...
متن کاملProgram Semantics, Intensional Logic and Compositionality
We apply intensional logic to the semantics of an Algol-like programming language. This associates with expressions their meanings relative to \possible worlds", here interpreted as machine states. These meanings lie in the semantic domains of a higher order typed intensional logic. The great advantage of this approach is that it preserves compositionality of the meaning function, even in \opaq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(99)00067-9